|
In mathematics, Euclid numbers are integers of the form , where ''p''''n''# is the ''n''th primorial, i.e. the product of the first ''n'' primes. They are named after the ancient Greek mathematician Euclid. It is sometimes falsely stated〔Michael Hardy and Catherine Woodgold, "Prime Simplicity", ''Mathematical Intelligencer'', volume 31, number 4, fall 2009, pages 44–52.〕 that Euclid's celebrated proof of the infinitude of prime numbers relied on these numbers. Euclid did not begin with the assumption that the set of all primes is finite. Rather, he said: consider any finite set of primes (he did not assume that it contained only the first ''n'' primes, e.g. it could have been ) and reasoned from there to the conclusion that at least one prime exists that is not in that set. The first few Euclid numbers are 3, 7, 31, 211, 2311, 30031, 510511 . It is not known whether or not there are an infinite number of prime Euclid numbers. ''E''''6'' = 13# + 1 = 30031 = 59 × 509 is the first composite Euclid number, demonstrating that not all Euclid numbers are prime. A Euclid number is congruent to 3 mod 4 since the primorial of which it is composed is twice the product of only odd primes and thus congruent to 2 modulo 4. This property implies that no Euclid number can be a square For all the last digit of ''E''''n'' is 1, since is divisible by 2 and 5. ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Euclid number」の詳細全文を読む スポンサード リンク
|